Weighted Cache Location Problem with Identical Servers

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the facility location problem: One-round weighted Voronoi game

Voronoi game presents a simple geometric model for Competitive facility location problems with two players. Voronoi game is played by two players known as White and Black, they play in a continuous arena. In the one-round game, White starts game and places all his points in the arena then Black places her points. Then the arena is divided by distance between two players and the player with the ...

متن کامل

Managing Customer Arrivals in Service Systems with Multiple Identical Servers

We analyze a discrete multi-server model for scheduling customer arrivals under no-shows. The challenge is to assign customers to time slots so that the service system utilizes its resources efficiently and customers experience short waiting times. We provide theoretical and heuristic guidelines for an effective practice of appointment overbooking in order to offset no-shows. Recursive and expl...

متن کامل

Performance Modeling of Proxy Cache Servers

The primary aim of the present paper is to modify the performance model of Bose and Cheng [1] to a more realistic case when external visits are also allowed to the remote Web servers and the Web servers have limited buffer. We analyze how many parameters affect the performance of a Proxy Cache Server. Numerical results are obtained for the overall response time with and without a PCS. These res...

متن کامل

Multi-Period Facility Location Problem with an Uncertain Number of Servers

We study the problem of allocating doctors to primary health centers. We model the problem as a multi-period uncapacitated facility location problem under uncertainty. The problem is unconventional in that the uncertainty is in the number and period of availability of doctors. We use a minmax regret approach to solve the problem. We present solution techniques using local search and tabu search...

متن کامل

A multi-objective model for facility location-allocation problem with immobile servers within queuing framework

This research investigates a practical bi-objective model for the facility location–allocation (BOFLA) problemwith immobile servers and stochastic demand within the M/M/1/K queue system. The first goal of the research is to develop a mathematical model in which customers and service providers are considered as perspectives. The objectives of the developed model are minimization of the total cos...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Applied Mathematics

سال: 2014

ISSN: 1110-757X,1687-0042

DOI: 10.1155/2014/586146